A note on 3-Steiner intervals and betweenness

نویسندگان

  • Manoj Changat
  • Anandavally K. Lakshmikuttyamma
  • Joseph Mathews
  • Iztok Peterin
  • Prasanth G. Narasimha-Shenoi
  • Aleksandra Tepeh
چکیده

The geodesic and geodesic interval, namely the set of all vertices lying on geodesics between a pair of vertices in a connected graph, is a part of folklore in metric graph theory. It is also known that Steiner tree of a (multi) set with k (k > 2) vertices, generalizes geodesics. In [1] the authors studied the k-Steiner intervals S(u1, u2, . . . , uk) on connected graphs (k ≥ 3) as the k-ary generalization of the geodesic intervals. The analogous betweenness axiom (b2) and the monotone axiom (m) were generalized from binary to k-ary functions as: for any u1, . . . , uk, x, x1, . . . , xk ∈ V (G) which are not necessarily distinct, (b2) x ∈ S(u1, u2, . . . , uk) ⇒ S(x, u2, . . . , uk) ⊆ S(u1, u2, . . . , uk), (m) x1, . . . , xk ∈ S(u1, . . . , uk) ⇒ S(x1, . . . , xk) ⊆ S(u1, . . . , uk). The authors conjectured in [1] that the 3-Steiner interval on a connected graph G satisfies the betweenness axiom (b2) if and only if each block of G is geodetic of diameter at most 2. In this paper we settle this conjecture. For this we show that there exists an isometric cycle of length 2k + 1, k > 2, in every geodetic block of diameter at least 3. We also introduce another axiom (b2(2)), which is meaningful only to 3-Steiner intervals and show that this axiom is equivalent to the monotone axiom.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Steiner intervals, geodesic intervals, and betweenness

∗Work supported by the Ministry of Science of Slovenia and by the Ministry of Science and Technology of India under the bilateral India-Slovenia grants BI-IN/06-07-002 and DST/INT/SLOV-P03/05, respectively. †Authors are also with the Institute of Mathematics, Physics and Mechanics, Ljubljana, Slovenia.

متن کامل

A Comparison of Algebraic, Metric, and Lattice Betweenness

Introduction. We propose to investigate here the consequences of the identity of each pair chosen from three important generalizations of the relation of betweenness on a line, namely, algebraic betweenness [l, p. 27 J, metric betweenness [3, p. 36], and lattice betweenness [7, Part I I ] . We shall also find an interpretation of metric betweenness in the Banach space of all continuous function...

متن کامل

Note on the Hardness of Bounded Budget Betweenness Centrality Game with Path Length Constraints

In this technical report, we generalize the betweenness definition in Bounded Budget Betweenness Centrality Game (called B3C game) introduced in [1] to only count shortest paths with a length limit `. We denote this game `-B3C game. We prove that the hardness results in [1] about nonuniform game still hold in this generalized version. In Section 2, we provide the detailed definition of the `-B3...

متن کامل

ary TRANSIT FUNCTIONS IN GRAPHS

n-ary transit functions are introduced as a generalization of binary (2-ary) transit functions. We show that they can be associated with convexities in natural way and discuss the Steiner convexity as a natural n-ary generalization of geodesicaly convexity. Furthermore, we generalize the betweenness axioms to n-ary transit functions and discuss the connectivity conditions for underlying hypergr...

متن کامل

N-ary Transit Functions in Graphs

n-ary transit functions are introduced as a generalization of binary (2-ary) transit functions. We show that they can be associated with convexities in natural way and discuss the Steiner convexity as a natural n-ary generalization of geodesicaly convexity. Furthermore, we generalize the betweenness axioms to n-ary transit functions and discuss the connectivity conditions for underlying hypergr...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Discrete Mathematics

دوره 311  شماره 

صفحات  -

تاریخ انتشار 2011